New Algorithms for Minimizing the Weighted Number of Tardy Jobs On a Single Machine
نویسندگان
چکیده
In this paper we study the classical single machine scheduling problem where the objective is to minimize the weighted number of tardy jobs. Our analysis focuses on the case where one or more of three natural parameters is either constant or is taken as a parameter in the sense of parameterized complexity. These three parameters are the number of different due dates, processing times, and weights in our set of input jobs. We show that the problem belongs to the class of fixed parameter tractable (FPT) problems when combining any two of these three parameters. We also show that the problem is polynomial-time solvable when the latter two parameters are constant, complementing Karp’s result who showed that the problem is NP-hard already for a single due date.
منابع مشابه
Minimizing a General Penalty Function on a Single Machine via Developing Approximation Algorithms and FPTASs
This paper addresses the Tardy/Lost penalty minimization on a single machine. According to this penalty criterion, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Besides its application in real world problems, Tardy/Lost measure is a general form for popular objective functions like weighted tardiness, late work and tardiness with reje...
متن کاملMinimizing the Number of Tardy Jobs in the Single Machine Scheduling Problem under Bimodal Flexible and Periodic Availability Constraints
In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...
متن کاملA branch and bound algorithm to minimize the total weighted number of tardy jobs and delivery costs with late deliveries for a supply chain scheduling problem
In this paper, we study a supply chain scheduling problem that simultaneously considers production scheduling and product delivery. jobs have to be scheduled on a single machine and delivered to customers for further processing in batches. The objective is to minimize the sum of the total weighted number of tardy jobs and the delivery costs. In this paper, we present a heuristic algorithm (HA...
متن کاملMinimizing Total Weighted Tardiness with Drop Dead Dates in Single Machine Scheduling Problem
This paper deals with minimization of tardiness in single machine scheduling problem when each job has two different due-dates i.e. ordinary due-date and drop dead date. The drop dead date is the date in which jobs’ weights rise sharply or the customer cancels the order. A linear programming formulation is developed for the problem and since the problem is known to be NP-hard, three heuristic...
متن کاملA New ILP Model for Identical Parallel-Machine Scheduling with Family Setup Times Minimizing the Total Weighted Flow Time by a Genetic Algorithm
This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...
متن کاملMinimizing the number of tardy job units under release time constraints
We study two single-machine scheduling problems: Minimizing the weighted and unweighted number of tardy units, when release times are present. Fast strongly polynomial algorithms are given for both problems: For problems with n jobs, we give algorithms which require O(n log n) and O(n2) steps, for the unweighted and weighted problems respectively. Our results also imply an extension of the fami...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 145 شماره
صفحات -
تاریخ انتشار 2003